例句與造句

1. The article claims to be about a comparison sort with runtime O ( n log log n )!
2. can we differentiate log log sin x ?  Preceding contribs ) 03 : 58, 11 November 2009 ( UTC)
3. During the Oligocene-Miocene, the Pehuenche orogeny caused widespread sedimentation in the region, forming the Log Log Formation.
4. In 1815, Peter Mark Roget invented the log log slide rule, which included a scale displaying the logarithm of the logarithm.
5. By extending this approach to carry look-ahead adders, it is possible to add in O ( log log n ) time.
6. It's difficult to find log log in a sentence. 用log log造句挺難的
7. He then chaired the Naval Academy mathematics department for three years while the Naval Academy developed the Keuffel & Esser Log Log Trig slide rule.
8. However, Dynamic Interpolation Search is possible in " o " ( log log " n " ) time using a novel data structure.
9. The Mertens function for all integer values up to " x " may be computed in " O ( x log log x ) " time.
10. To improve performance, the BBS generator can securely output up to O ( log log N ) of the least-significant bits of x _ i during each round.
11. After that, the successor or predecessor can be found in constant time, so the total query time is " O " ( log log " M " ).
12. If a language is " not " regular, it requires a machine with at least o ( log log " n " ) ) equals the class of regular languages.
13. :Assuming it actually is O ( n log log n ), then I think it's violating the O ( n log n ) barrier on comparison sorts by actually being a bucket sort variation.
14. The best known approximation algorithm computes a coloring of size at most within a factor O ( " n " ( log n ) & minus; 3 ( log log " n " ) 2 ) of the chromatic number.
15. If the input coordinates are integers and can be used as array indices, faster algorithms are possible : the Delaunay triangulation can be constructed by a randomized algorithm in O ( " n " log log " n " ) expected time.
16. This is an extension of the Hardy Ramanujan theorem, which states that the normal order of ? ( " n " ) is log log " n " with a typical error of size \ sqrt { \ log \ log n }.
更多例句：  下一頁